Modal logics of answers
نویسنده
چکیده
This paper aims to apply modal logics arising from partitionistic structures to the logic of questions and answers. Taking it for granted that a partition of possible worlds serves as a representation of a context, the idea of multi-contextual situation motivates the proposal of partitionistic structures. Logical properties of answers are represented by modal operators on such structures. 1 Motivating examples 1.1 Twenty questions Twenty questions is a two-player game to find what the answerer has in mind by posing at most twenty yes-no questions. In this example, suppose that the range of possible answers is a set of numbers from 1 to 1,000,000. Since a million is a bit less than 2, a wise questioner must be able to find the correct answer. How can she reach it? Questioners may or may not be wise. For example, a questioner may ask “Can it fly?” to lose a precious opportunity; the question could yield no meaningful answer. Another bad way is to ask “Is the number less than 500,000?” in the first turn and get the answer yes, and then to ask “Is it more than 750,000?” Obviously, the answer is no, and he will lose a question without obtaining any information. Another poor way is to repeat a question. Suppose the question “Is the number less than 500,000?” in the first turn gets the answer yes. Repeating the same question “Is the number less than 500,000?” would obtain the answer yes, but it does not help the questioner to squeeze the range of possibilities any more. Now, it is natural for logicians to ask the following questions. What logical properties do such poor ways of asking questions bear? Can they be characterized? Let us return to focus on a wise questioner. A systematic strategy is to cut the range in the half in each round. For example, asking “Is the number less than 500,001?” in the first turn submits a binary partition of the original range:
منابع مشابه
Complexity Results for Some Logics of Inconsistent Belief
Modal logics of knowledge have been used to represent and reason about such varied topics as distributed and multi-agent systems, security protocols, and interactive proof systems. We investigate a class of modal logics for representing agents or systems with imperfect or inconsistent knowledge. These logics replace the usual closure under full conjunction for the ¤ operator with progressively ...
متن کاملComplexity results for logics of local reasoning and inconsistent belief
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning inconsistent knowledge and logical omniscience. We investigate a class of related modal logics. These logics replace the usual closure under full conjunction for the ¤ operator with progressively weaker versions, and comprise a ...
متن کاملSchematic Validity in Dynamic Epistemic Logic: Decidability
Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. The classic example is Public Announcement Logic (PAL), an extension of epistemic logic based on the idea of information acquisition as elimination of possibilities. In this paper, we address the open question of whether the set of schematic validities of PAL, the set of formulas all of whose ...
متن کاملDov Gabbay: Fibring Logics. a Review
Studying combined logics is a growing trend in applied logic. The general question is this: Suppose language L 3 has been formed by fusion of two languages L 1 and L 2. Let two logics L 1 and L 2 be defined over L 1 and L 2 , respectively. What can be said about conservative extensions L 3 in L 3 ? This is a fairly broad problem. Conservative extensions are not unique, and they may have differe...
متن کاملIntroducing Temporal Description Logics
Description Logics are formalisms designed for a logical reconstruction of representation tools such as frames, Object-Oriented and semantic data models, semantic networks, type systems, and feature logics. Nowadays, description logics are also considered the most important unifying formalism for the many object-centred representation languages used in areas other than Knowledge Representation....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005